On Finite-time Computability Preserving Conversions
نویسندگان
چکیده
A finite-time computable function is a partial function from Σ to Σ whose value is constructed by concatenating a finite list with a suffix of the argument. A finite-time computability preserving conversion α : X → Y for X,Y ⊂ Σ is a bijection which preserves finite-time computability. We show that all the finite-time computability preserving conversions with the domain Σ are extended sliding block functions.
منابع مشابه
An efficient nonstandard numerical method with positivity preserving property
Classical explicit finite difference schemes are unsuitable for the solution of the famous Black-Scholes partial differential equation, since they impose severe restrictions on the time step. Furthermore, they may produce spurious oscillations in the solution. We propose a new scheme that is free of spurious oscillations and guarantees the positivity of the solution for arbitrary stepsizes. The...
متن کاملOn equality of absolute central and class preserving automorphisms of finite $p$-groups
Let $G$ be a finite non-abelian $p$-group and $L(G)$ denotes the absolute center of $G$. Also, let $Aut^{L}(G)$ and $Aut_c(G)$ denote the group of all absolute central and the class preserving automorphisms of $G$, respectively. In this paper, we give a necessary and sufficient condition for $G$ such that $Aut_c(G)=Aut^{L}(G)$. We also characterize all finite non-abelian $p$-groups of order $p^...
متن کاملCharacterizing Strongly Normalizing Terms of a Calculus with Generalized Applications via Intersection Types
An intersection type assignment system for the extension ΛJ of the untyped λ-calculus, introduced by Joachimski and Matthes, is given and proven to characterize the strongly normalizing terms of ΛJ. Since ΛJ’s generalized applications naturally allow permutative/commuting conversions, this is the first analysis of a term rewrite system with permutative conversions by help of intersection types....
متن کاملStage-preserving Embeddings of Languages
Embeddings of languages into one another are useful in studying their relative power and, sometimes, finding languages that are universal in some sense. Examples include Turing-reducibility for studying computability, poly-time reductions for subrecursive languages [14], and structure-preserving embeddings for expressiveness [4, 5, 13, 12]. To further a search for languages suitable for “domain...
متن کاملShort Proofs of Normalization for the simply-typed λ-calculus, permutative conversions and Gödel’s T
Inductive characterizations of the sets of terms, the subset of strongly normalizing terms and normal forms are studied in order to reprove weak and strong normalization for the simplytyped λ-calculus and for an extension by sum types with permutative conversions. The analogous treatment of a new system with generalized applications inspired by generalized elimination rules in natural deduction...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 221 شماره
صفحات -
تاریخ انتشار 2008